Local Partitioning for Directed Graphs Using PageRank
نویسندگان
چکیده
A local partitioning algorithm finds a set with small conductance near a specified seed vertex. In this paper, we present a generalization of a local partitioning algorithm for undirected graphs to strongly connected directed graphs. In particular, we prove that by computing a personalized PageRank vector in a directed graph, starting from a single seed vertex within a set S that has conductance at most α, and by performing a sweep over that vector, we can obtain a set of vertices S′ with conductance ΦM (S ′) = O( p α log |S|). Here, the conductance function ΦM is defined in terms of the stationary distribution of a random walk in the directed graph. In addition, we describe how this algorithm may be applied to the PageRank Markov chain of an arbitrary directed graph, which provides a way to partition directed graphs that are not strongly connected.
منابع مشابه
Graph partitioning and a componentwise PageRank algorithm
In this article we will present a graph partitioning algorithm which partitions a graph into two different types of components: the well-known ‘strongly connected components’ as well as another type of components we call ‘connected acyclic component’. We will give an algorithm based on Tarjan’s algorithm for finding strongly connected components used to find such a partitioning. We will also sh...
متن کاملLocal Partition in Rich Graphs
Local graph partitioning is a key graph mining tool that allows researchers to identify small groups of interrelated nodes (e.g. people) and their connective edges (e.g. interactions). Because local graph partitioning is primarily focused on the network structure of the graph (vertices and edges), it often fails to consider the additional information contained in the attributes. In this paper w...
متن کاملIRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Local Approximation of PageRank and Reverse PageRank
We consider the problem of approximating the PageRank of a target node using only local information provided by a link server. This problem was originally studied by Chen, Gan, and Suel (CIKM 2004), who presented an algorithm for tackling it. We prove that local approximation of PageRank, even to within modest approximation factors, is infeasible in the worst-case, as it requires probing the li...
متن کاملA Local Graph Partitioning Algorithm Using Heat Kernel Pagerank
We give an improved local partitioning algorithm using heat kernel pagerank, a modified version of PageRank. For a subset S with Cheeger ratio (or conductance) h, we show that there are at least a quarter of the vertices in S that can serve as seeds for heat kernel pagerank which lead to local cuts with Cheeger ratio at most O( √ h), improving the previously bound by a factor of p log |S|.
متن کاملThe heat kernel as the pagerank of a graph
The concept of pagerank was first started as a way for determining the ranking of Webpages by Web search engines. Based on relations in interconnected networks, pagerank has become a major tool for addressing fundamental problems arising in general graphs, especially for large information networks with hundreds of thousands of nodes. A notable notion of pagerank, introduced by Brin and Page and...
متن کامل